An Algorithm for Path Connections and Its Applications
نویسنده
چکیده
The algorithm described in this paper is the outcome Based on this model, we will consider a class of wellof an endeavor to answer the following question: Is it possible to find defined optimal path problems. A general procedure for procedures which would enable a computer to solve efficiently paths t c o p ... ~solving this class of problems will then be given in Secconnection problems inherent in logical drawing, wiring diagram-
منابع مشابه
3D Path Planning Algorithm for Mobile Anchor-Assisted Positioning in Wireless Sensor Networks
Positioning service is one of Wireless Sensor Networks’ (WSNs) fundamental services. The accurate position of the sensor nodes plays a vital role in many applications of WSNs. In this paper, a 3D positioning algorithm is being proposed, using mobile anchor node to assist sensor nodes in order to estimate their positions in a 3D geospatial environment. However, mobile anchor node’s 3D path optim...
متن کاملDesign of optimal central guidance of an underwater vehicle in the modeled ship wake
The purpose of this paper is to provide a new algorithm for guidance of an underwater vehicle to reach its target, and demonstrate its effectiveness by simulation with a computer code. The meant of target in here is to chase a ship on the surface of the water. In order to do this, one of the most effective methods is to follow the ship wake which produced behind it. Disadvantages of wake guidan...
متن کاملAn Efficient Method for Selecting a Reliable Path under Uncertainty Conditions
In a network that has the potential to block some paths, choosing a reliable path, so that its survival probability is high, is an important and practical issue. The importance of this issue is very considerable in critical situations such as natural disasters, floods and earthquakes. In the case of the reliable path, survival or blocking of each arc on a network in critical situations is an un...
متن کاملSolving Routing Problems with Cellular Automata
New variants of the classical Lee algorithm for the routing of connections on printed circuits or chips have been found when mapping it onto the cellular processing model. Two cellular algorithms are described: (1) a cellular shortest path algorithm with only 14 states per cell, which is independent of the grid size and (2) a parallel algorithm for routing multiple nets simultaneously. 1 Motiva...
متن کاملAn Optimized Online Secondary Path Modeling Method for Single-Channel Feedback ANC Systems
This paper proposes a new method for online secondary path modeling in feedback active noise control (ANC) systems. In practical cases, the secondary path is usually time-varying. For these cases, online modeling of secondary path is required to ensure convergence of the system. In literature the secondary path estimation is usually performed offline, prior to online modeling, where in the prop...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IRE Trans. Electronic Computers
دوره 10 شماره
صفحات -
تاریخ انتشار 1961